Lecturer : Chiu Yuen Koo Scribe ( s ) : Omer
نویسندگان
چکیده
In a previous lecture, we defined the Byzantine agreement/broadcast problems and showed that there is no protocol solving these problems when the fraction of corrupted players is 1/3 or larger. Today, we prove the converse by showing a protocol for broadcast (and hence Byzantine agreement; cf. the previous lecture) when the fraction of corrupted players is less than 1/3. The protocol we will show is called the Exponential Information Gathering (EIG) protocol, and was essentially the first known protocol for this task (see [2, 4, 1, 3]). We stress at the outset that the protocol is not very efficient — as the name suggests, its complexity is exponential in the number of players — but it forms an important feasibility result. Since the protocol was introduced, much work has focused on improving various parameters of the protocol, and fully polynomial Byzantine agreement/broadcast protocols with optimal resilience are now known.
منابع مشابه
Lecture 16 Lecturer: Jonathan Katz Scribe(s): 1 Digital Signature Schemes
• Vrfy takes as input a public key, a message, and a (purported) signature; it outputs a single bit b with b = 1 indicating acceptance and b = 0 indicating rejection. (We assume for simplicity that Vrfy is deterministic.) We write this as b = Vrfypk(m,σ). For correctness, we require that for all (pk, sk) output by Gen(1k), for all messages m, and for all σ output by Signsk(m) we have Vrfypk(m,σ...
متن کاملSTUDIES ON FAULT - TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor
Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...
متن کامل